Parallel Collision Detection with OpenMP
نویسندگان
چکیده
منابع مشابه
Parallel surface collision detection implementation with openmp
In assembly, disassembly and maintenance operations, it is necessary to find intersecting surfaces for the automatic recognition of geometric constraints between virtual prototypes. In this paper, we propose an algorithm to determine intersecting surfaces in virtual prototyping environments and use parallel computing methods to improve performance. The proposed algorithm is based on the Overlap...
متن کاملScalable parallel collision detection simulation
Several simulations for parallel collision detection have been suggested during the last years. The algorithms usually greatly depend on the parallel infrastructure and this dependency causes in many times non-scalability performance. The dependency also harms the portability of the simulation. This paper suggests a scalable and portable parallel algorithm for collision detection simulation tha...
متن کاملSynchronization-Free Parallel Collision Detection Pipeline
We present a first parallel and adaptive collision detection pipeline running on a multi-core architecture. This pipeline integrates a first global synchronization-free parallelization of its major steps and enables to dynamically adapt the parallelism repartition during the simulation. We propose to break the sequentiality of the pipeline by simultaneously executing the two main phases (broad ...
متن کاملA Parallel Linear Octree Collision Detection Algorithm
A new collision detection algorithm is presented that solves the all-pairs collision detection problem using parallel processing. The design of the algorithm is based on a linear octree and runs in parallel with a theoretical performance of O((n log n)/k) run time. The algorithm has been implemented as a collision detection system using object-oriented design techniques and a client-server arch...
متن کاملParallel Collision Detection in Constant Time
We prove that the maximum number of intersecting pairs spheres between two sets of polydisperse sphere packings is linear in the worst case. This observation is the basis for a new collision detection algorithm. Our new approach guarantees a linear worst case running time for arbitrary 3D objects. Additionally, we present a parallelization of our new algorithm that runs in constant time, even i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2018
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1069/1/012180